1998 Paper 4 Question 8 Computation Theory Explain Church’s Thesis, making clear its connection with computability. [3 marks] Define precisely what is meant by the set of all Primitive Recursive (PR) functions.

Source URL: www.cl.cam.ac.uk

On the completeness of quantum computation models Pablo Arrighi ´ Ecole normale sup´erieure de Lyon

Source URL: who.rocq.inria.fr

• Mathematical logic
• Applied mathematics
• Computable function
• Recursive set
• Enumeration
• Function
• Numbering
• Church–Turing thesis
• Computability
• Computability theory
• Theory of computation
• Mathematics

Balancing lists: a proof pearl? Guyslain Naves1 and Arnaud Spiwack2 1 Aix Marseille Université, CNRS, LIF UMR 7279, 13288, Marseille, France

Source URL: assert-false.net

• Recursion
• Higher-order functions
• Functional languages
• Mathematical logic
• Computability theory
• Binary tree
• Map
• Tree
• Binary search tree
• Computer programming
• Computing
• Software engineering

BRICS Basic Research in Computer Science BRICS DS-00-7 M. Jurdzi´nski: Games for Verification: Algorithmic Issues

Source URL: www.brics.dk

• Logic in computer science
• Computability theory
• Formal methods
• Model checking
• Theory of computation
• Algorithm
• BRIC
• Halting problem
• Formal verification
• Theoretical computer science
• Applied mathematics
• Mathematics

The Halting Problems of Network Stack Insecurity Le n S a s s a m a n , M e r e d i t h L . P a t t e r s o n , Se r g e y B r a t u s , and Anna Shubina Len Sassaman was a PhD

Source URL: static.usenix.org

• Computability theory
• Models of computation
• Turing machine
• Theory of computation
• Turing completeness
• Halting problem
• Universal Turing machine
• Parsing
• Deterministic pushdown automaton
• Theoretical computer science
• Computer science
• Applied mathematics

Towards an algebraic classification of recognizable sets of lambda-terms1 Sylvain Salvati INRIA Bordeaux sud-ouest, LaBRI, universit´ e de Bordeaux

Source URL: www.cmi.ac.in

• Models of computation
• Computability theory
• Lambda calculus
• Spectral theory
• Formal language
• Theoretical computer science
• Mathematics
• Applied mathematics

The Call-by-need Lambda Calculus, Revisited Stephen Chang and Matthias Felleisen College of Computer Science Northeastern University Boston, Massachusetts, USA { stchang | matthias } @ ccs.neu.edu

Source URL: www.ccs.neu.edu

• Theoretical computer science
• Lambda calculus
• Computability theory
• Evaluation strategy
• Calculus
• Free variables and bound variables
• Function
• Parameter
• Algorithm
• Mathematics
• Mathematical logic
• Applied mathematics

Alan Turing: the logical and physical basis of computing Andrew Hodges∗ Wadham College, University of Oxford, Oxford OX1 3PN, U.K. This paper is based on the talk given on 5 June 2004 at the conference at Manchester Un

Source URL: www.bcs.org

• Computer science
• Mathematics
• Alan Turing
• Turing machine
• Church–Turing thesis
• Computable function
• Halting problem
• Computable number
• Computability
• Computability theory
• Theory of computation
• Theoretical computer science

BRICS Basic Research in Computer Science BRICS RSU. Kohlenbach: On the Uniform Weak K¨onig’s Lemma On the Uniform Weak K¨onig’s Lemma

Source URL: www.brics.dk

• Proof theory
• Computability theory
• Functions and mappings
• Reverse mathematics
• Mathematical proofs
• Primitive recursive function
• Gödel–Gentzen negative translation
• Primitive recursive arithmetic
• Second-order arithmetic
• Mathematics
• Mathematical logic
• Logic

Brute Force is not Ignorance Joseph Davidson and Greg Michaelson School of Mathematical and Computer Sciences Heriot-Watt University, Edinburgh, Scotland {jrd5/G.Michaelson}@hw.ac.uk

Source URL: www.macs.hw.ac.uk

• Computer science
• Models of computation
• Turing machine
• Register machines
• Busy beaver
• Random access machine
• Random access stored program machine
• Computability
• Algorithm
• Theory of computation
• Theoretical computer science
• Computability theory